Non-convex mixed-integer nonlinear programming: A survey
نویسندگان
چکیده
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimisation problem. We survey the literature on non-convex MINLP, discussing applications, algorithms and software. Special attention is paid to the case in which the objective and constraint functions are quadratic.
منابع مشابه
Smart load shedding and distributed generation resources rescheduling to improve distribution system restoration performance
After a permanent fault occurs if it is not possible to supply the load in the network, the optimal load restoration scheme allows the system to restoration the load with the lowest exit cost, the lowest load interruption, and in the shortest possible time. This article introduces a new design called Smart Load Shedding, abbreviated SLS. In the proposed SLS scheme, the types of devices in smart...
متن کاملDisjunctive Cuts for Mixed Integer Nonlinear Programming Problems
We survey recent progress in applying disjunctive programming theory for the effective solution of mixed integer nonlinear programming problems. Generation of effective cutting planes is discussed for both the convex and nonconvex cases.
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملAlgorithms and Software for Convex Mixed Integer Nonlinear Programs
This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in recent years. By exploiting analogies to well-known techniques for solving ...
متن کاملExtended ant colony optimization for non-convex mixed integer nonlinear programming
Two novel extensions for the well known Ant Colony Optimization (ACO) framework are introduced here, which allow the solution of Mixed Integer Nonlinear Programs (MINLP). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have bee...
متن کامل